Enumeration of strictly Deza graphs with at most 21 vertices
نویسندگان
چکیده
A Deza graph $\Gamma$ with parameters $(v,k,b,a)$ is a $k$-regular $v$ vertices such that any two distinct have $b$ or $a$ common neighbours, where $b \ge a$. of diameter 2 which not strongly regular called strictly graph. We find all 139 graphs up to 21 vertices.
منابع مشابه
COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملcospectrality measures of graphs with at most six vertices
cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. actually,the origin of this concept came back to richard brualdi's problems that are proposed in cite{braldi}:let $g_n$ and $g'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2 g...
متن کاملThe Transitive Graphs with at Most 26 Vertices
We complete the construction of all the simple graphs with at most 26 vertices and transitive automorphism group. The transitive graphs with up to 19 vertices were earlier constructed by McKay, and the transitive graphs with 24 vertices by Praeger and Royle. Although most of the construction was done by computer, a substantial preparation was necessary. Some of this theory may be on independent...
متن کاملChromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملAll Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs
A graph G is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(lu, lv) ≤ dmax where dT,w(lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this note, we show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ????????? ??????????? ?????????????? ????????
سال: 2021
ISSN: ['1813-3304']
DOI: https://doi.org/10.33048/semi.2021.18.107